Study on stealth characteristics of metamaterials based on simulated annealing algorithm
نویسندگان
چکیده
منابع مشابه
study of hash functions based on chaotic maps
توابع درهم نقش بسیار مهم در سیستم های رمزنگاری و پروتکل های امنیتی دارند. در سیستم های رمزنگاری برای دستیابی به احراز درستی و اصالت داده دو روش مورد استفاده قرار می گیرند که عبارتند از توابع رمزنگاری کلیددار و توابع درهم ساز. توابع درهم ساز، توابعی هستند که هر متن با طول دلخواه را به دنباله ای با طول ثابت تبدیل می کنند. از جمله پرکاربردترین و معروف ترین توابع درهم می توان توابع درهم ساز md4, md...
Research on Emergency Vehicles Routing Based on Simulated Annealing Algorithm ⋆
Optimization of emergency vehicles routing is a complicated system engineering that is influenced by multitudinous factors. To improve efficiency of emergency rescuing, the optimization model of emergency vehicles routing have also been built, And on that basis, and optimization algorithm have also been put forward based on simulated annealing algorithm. Finally, in order to testify validity, o...
متن کاملStudy on the Layout Optimization of Platform Based on Simulated Annealing Algorithm
Aiming at the production scheduling problem in the hull block production, this study investigates the maximum use of the assembly blocks working platform. By transforming the scheduling problem into two-dimensional bin packing problem, this study explores the effective block spatial layout under the condition of spatial constraints. In order to improve the drawbacks of the lowest horizontal lin...
متن کاملA simulated annealing method based on a specialised evolutionary algorithm
The flexible architecture of evolutionary algorithms allows specialised models to be obtained with the aim of performing as other search methods do, but more satisfactorily. In fact, there exist several evolutionary proposals in the literature that play the role of local search methods. In this paper, we make a step forward presenting a specialised evolutionary approach that carries out a search
متن کاملA Fast KNN Algorithm Based on Simulated Annealing
-K-Nearest Neighbor is used broadly in text classification, but it has one deficiency—computational efficiency. In this paper, we propose a heuristic search way to find out the k nearest neighbors quickly. Simulated annealing algorithm and inverted array are used to help find out the expected neighbors. Our experimental results demonstrate a significant improvement in classification computation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2019
ISSN: 1877-0509
DOI: 10.1016/j.procs.2019.01.230